Alternating-Offer Bargaining Games over the Gaussian Interference Channel

This paper tackles the problem of how two selfish users jointly determine the operating point in the achievable rate region of a two-user Gaussian interference channel through bargaining. In previous work, incentive conditions for two users to cooperate using a simple version of Han-Kobayashi scheme was studied and the Nash bargaining solution (NBS) was used to obtain a fair operating point. Here a noncooperative bargaining game of alternating offers is adopted to model the bargaining process and rates resulting from the equilibrium outcome are analyzed. In particular, it is shown that the operating point resulting from the formulated bargaining game depends on the cost of delay in bargaining and how bargaining proceeds. If the associated bargaining problem is regular, a unique perfect equilibrium exists and lies on the individual rational efficient frontier of the achievable rate region. Besides, the equilibrium outcome approaches the NBS if the bargaining costs of both users are negligible.Comment: 8 pages, 6 figures, to appear in Proceedings of Forty-Eighth Annual Allerton Conference on Communication, Control, and Computin

Coordination and Bargaining over the Gaussian Interference Channel

This work considers coordination and bargaining between two selfish users over a Gaussian interference channel using game theory. The usual information theoretic approach assumes full cooperation among users for codebook and rate selection. In the scenario investigated here, each selfish user is willing to coordinate its actions only when an incentive exists and benefits of cooperation are fairly allocated. To improve communication rates, the two users are allowed to negotiate for the use of a simple Han-Kobayashi type scheme with fixed power split and conditions for which users have incentives to cooperate are identified. The Nash bargaining solution (NBS) is used as a tool to get fair information rates. The operating point is obtained as a result of an optimization problem and compared with a TDM-based one in the literature.Comment: 5 pages, 4 figures, to appear in Proceedings of IEEE ISIT201

Multi-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective

We consider a general multiple antenna network with multiple sources, multiple destinations and multiple relays in terms of the diversity-multiplexing tradeoff (DMT). We examine several subcases of this most general problem taking into account the processing capability of the relays (half-duplex or full-duplex), and the network geometry (clustered or non-clustered). We first study the multiple antenna relay channel with a full-duplex relay to understand the effect of increased degrees of freedom in the direct link. We find DMT upper bounds and investigate the achievable performance of decode-and-forward (DF), and compress-and-forward (CF) protocols. Our results suggest that while DF is DMT optimal when all terminals have one antenna each, it may not maintain its good performance when the degrees of freedom in the direct link is increased, whereas CF continues to perform optimally. We also study the multiple antenna relay channel with a half-duplex relay. We show that the half-duplex DMT behavior can significantly be different from the full-duplex case. We find that CF is DMT optimal for half-duplex relaying as well, and is the first protocol known to achieve the half-duplex relay DMT. We next study the multiple-access relay channel (MARC) DMT. Finally, we investigate a system with a single source-destination pair and multiple relays, each node with a single antenna, and show that even under the idealistic assumption of full-duplex relays and a clustered network, this virtual multi-input multi-output (MIMO) system can never fully mimic a real MIMO DMT. For cooperative systems with multiple sources and multiple destinations the same limitation remains to be in effect.Comment: version 1: 58 pages, 15 figures, Submitted to IEEE Transactions on Information Theory, version 2: Final version, to appear IEEE IT, title changed, extra figures adde

Interactive Relay Assisted Source Coding

This paper investigates a source coding problem in which two terminals communicating through a relay wish to estimate one another's source within some distortion constraint. The relay has access to side information that is correlated with the sources. Two different schemes based on the order of communication, \emph{distributed source coding/delivery} and \emph{two cascaded rounds}, are proposed and inner and outer bounds for the resulting rate-distortion regions are provided. Examples are provided to show that neither rate-distortion region includes the other one.Comment: Invited Paper submitted to GlobalSIP: IEEE Global Conference on Signal and Information Processing 201